A Visual Interface for Concretizing Sorting Algorithms
نویسنده
چکیده
Algorithm visualization is an efficient way to teach programming. Several different visualization techniques have been developed in the past decades. The Concretization Environment Framework, CEF, combines algorithm visualization with concrete objects (e.g. Lego Mindstorms robots). CELM, Concretization Environment for Lego Mindstorms is an application of this framework. By using the framework, the user can turn the mental model the user has into a concrete one. User feedback on the framework and its application has confirmed the functionality of the concept and the usefulness of the approach. ACM-classification (ACM Computing Classification System, 1998 version): K.3.2 [Computer and Education]: Computer and Information Science Education Computer Science Education; I.6.8 [Simulation and Modeling]: Types of Simulation Distributed, Parallel
منابع مشابه
Design, Development and Evaluation of an Orange Sorter Based on Machine Vision and Artificial Neural Network Techniques
ABSTRACT- The high production of orange fruit in Iran calls for quality sorting of this product as a requirement for entering global markets. This study was devoted to the development of an automatic fruit sorter based on size. The hardware consisted of two units. An image acquisition apparatus equipped with a camera, a robotic arm and controller circuits. The second unit consisted of a robotic...
متن کاملAn Adapted Non-dominated Sorting Algorithm (ANSA) for Solving Multi Objective Trip Distribution Problem
Trip distribution deals with estimation of trips distributed among origins and destinations and is one of the important stages in transportation planning. Since in the real world, trip distribution models often have more than one objective, multi-objective models are developed to cope with a set of conflict goals in this area. In a proposed method of adapted non-dominated sorting algorithm (ANS...
متن کاملA knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells
This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...
متن کاملParallel Algorithms and Structures for Implementation of Merge Sort
I. INTODACTION The development of information technologies is characterized by the expansion of applications, many of which requires parallel sorting of data sets in real-time. You can provide such data sorting by using of specialized tools, which architecture maps the structure of the sorting algorithm on hardware and is oriented on VLSI implementation. Implementation of highly efficient speci...
متن کاملTeaching and learning computer science sorting algorithms with mobile devices: A case study
In this paper we present a semester-long study on using smartphone devices in computing engineering education. We developed Sortko, an Android-based smartphone application for learning sorting algorithms, an important undergraduate computer science topic. The application consists of four main components the module for interactive sorting, the scaffolding module, the motivational module and the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004